{
  "name" : "lcm",
  "version" : "0.0.3",
  "description" : "compute the least common multiple using Euclidean algorithm",
  "main": "index.js",
  "directories": {
    "example": "example",
    "test": "test"
  },
  "dependencies": {
    "gcd": "^0.0.1"
  },
  "devDependencies": {
    "tape": "^2.13.1"
  },
  "scripts": {
    "test": "tape test/*.js"
  },
  "repository": {
    "type": "git",
    "url": "git://github.com/nickleefly/node-lcm.git"
  },
  "keywords": [
    "lcm",
    "math",
    "euclidean"
  ],
  "author": {
    "name": "Xiuyu Li",
    "email": "nickleefly@gmail.com",
    "url": "https://bit.ly/nickleefly"
  },
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/nickleefly/node-lcm/issues"
  },
  "homepage": "https://github.com/nickleefly/node-lcm"
}
